//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by FernFlower decompiler)
//

package 力扣.题库.未分类;

public class demo_2643 {
    public demo_2643() {
    }

    public int[] rowAndMaximumOnes(int[][] mat) {
        int[] out = new int[]{0, 0};

        for(int i = 0; i < mat.length; ++i) {
            int ones = 0;

            for(int j = 0; j < mat[i].length; ++j) {
                if (mat[i][j] == 1) {
                    ++ones;
                }
            }

            if (ones > out[1]) {
                out[0] = i;
                out[1] = ones;
            }
        }

        return out;
    }
}
